Random graphs with arbitrary clustering and their applications

The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, S. Dobson, Percolation in random graphs with higher-order clustering, arXiv e-prints, p. arXiv:2006.06744, June 2020.], we developed analytical solutions the properties homogeneous clustering (clusters whose nodes are degree-equivalent). this paper, extend model investigate that contain clusters degree-equivalent, including multilayer networks. Through numerical examples show how method can be used complex arbitrary extending applicability configuration generating function formulation.